Arithmetic Function Interpreter in C# 3.0 Using Lambda Expression Trees

Here the first generic parameter indicates that the independent variable, x, is of type double and the second generic parameter, of type double, is the return type. In general a lambda expression is written as a parameter list, followed by the => token, followed by an expression or a statement block. Expression trees, another new C# 3.0 feature, allow lambda expressions to be represented as data structures instead of executable code. Expression trees are “efficient in-memory data representations of lambda expressions and make the structure of the expression transparent and explicit” (Microsoft C# 3.0 Specifications -http://msdn2.microsoft.com/en-us/library/ms364047(vs.80).aspx#cs3spec_topic9 ). An expression tree could be defined as follows: